Logarithmic Sobolev, Isoperimetry and Transport Inequalities on Graphs
نویسندگان
چکیده
In this paper, we study some functional inequalities (such as Poincaré inequality, logarithmic Sobolev inequality, generalized Cheeger isoperimetric inequality, transportation-information inequality and transportation-entropy inequality) for reversible nearest-neighbor Markov processes on connected finite graphs by means of (random) path method. We provide estimates of the involved constants.
منابع مشابه
Log-sobolev, Isoperimetry and Transport Inequalities on Graphs
In this paper, we study some functional inequalities (such as Poincaré inequalities, logarithmic Sobolev inequalities, generalized Cheeger isoperimetric inequalities, transportation-information inequalities and transportation-entropy inequalities) for reversible nearest-neighbor Markov processes on a connected finite graph by means of (random) path method. We provide estimates of the involved c...
متن کاملIsoperimetry and Symmetrization for Logarithmic Sobolev Inequalities
Using isoperimetry and symmetrization we provide a unified framework to study the classical and logarithmic Sobolev inequalities. In particular, we obtain new Gaussian symmetrization inequalities and connect them with logarithmic Sobolev inequalities. Our methods are very general and can be easily adapted to more general contexts.
متن کاملLogarithmic Harnack inequalities∗
Logarithmic Sobolev inequalities first arose in the analysis of elliptic differential operators in infinite dimensions. Many developments and applications can be found in several survey papers [1, 9, 12]. Recently, Diaconis and Saloff-Coste [8] considered logarithmic Sobolev inequalities for Markov chains. The lower bounds for log-Sobolev constants can be used to improve convergence bounds for ...
متن کاملModified Logarithmic Sobolev Inequalities in Discrete Settings
Motivated by the rate at which the entropy of an ergodic Markov chain relative to its stationary distribution decays to zero, we study modified versions of logarithmic Sobolev inequalities in the discrete setting of finite Markov chains and graphs. These inequalities turn out to be weaker than the standard log-Sobolev inequality, but stronger than the Poincare’ (spectral gap) inequality. We sho...
متن کاملGeneralization of an Inequality by Talagrand, and Links with the Logarithmic Sobolev Inequality
We show that transport inequalities, similar to the one derived by Talagrand [30] for the Gaussian measure, are implied by logarithmic Sobolev inequalities. Conversely, Talagrand’s inequality implies a logarithmic Sobolev inequality if the density of the measure is approximately log-concave, in a precise sense. All constants are independent of the dimension, and optimal in certain cases. The pr...
متن کامل